Performance analysis of ATM routing with nonlinear equivalent capacity: symmetric case
نویسندگان
چکیده
This paper presents a performance analysis of ATM routing with nonlinear equivalent capacity in symmetric and fully connected network. The conventional dynamic alternative routing (DAR) is here extended to the environment of multiple services with nonlinear equivalent capacity. This extension uses the trunk reservation policy and dynamic service/route separation. The analytical model of generalized DAR is formulated by a reduced-load approximation and then solved by a linear approximation model and traffic grouping. The analytical results are here found to be in good agreement with 95% confidence interval of discrete-event simulations. To solve the analytical model, the required time complexity is and the space complexity is , where is the link capacity and is the number of capacity-guaranteed services. Best-effort services are also considered in the comparison of the generalized DAR when the connection admission control (CAC) is based on either nonlinear equivalent capacity or standard peak-rate assignment. The reported numerical results suggest that the CAC with nonlinear equivalent capacity can increase the total mean revenue rate of the generalized DAR by up to for the scenarios of single capacity-guaranteed service and for the scenarios of three capacity-guaranteed services.
منابع مشابه
A Simplified Modal Pushover Analysis-based Method for Incremental Dynamic Analysis of Regular RC Moment-resisting Frames
Incremental Dynamic Analysis (IDA) procedure is now considered as a robust tool for estimating the seismic sidesway collapse capacity of structures. However, the procedure is time-consuming and requires numerous nonlinear response-history analyses. This paper proposes a simplified Modal Pushover Analysis (MPA) procedure for IDA of RC moment-resisting frames. The proposed method uses the dynamic...
متن کاملVirtual Path Assignment and Virtual Circuit Routing in ATM Networks
The use of virtual paths in ATM networks reduces the call set-up delays, simplifies the hardware in the transit nodes and provides simple virtual circuit admission control. However, it also reduces the degree of capacity sharing and thus, increases the call blocking rate. We consider the following problem: given a network topology, link capacity of each physical link and traffic requirement of ...
متن کاملOn the Joint Virtual Path Assignment and Virtual Circuit Routing Problem in ATM Networks - Global Telecommunications Conference, 1994. GLOBECOM '94. 'Communications: The Global Bridge'., IE
The use of virtual paths in ATM networks reduces the call set-up delays, simplifies the hardware in the transit nodes and provides simple virtual circuit admission control. However, i t also reduces the degree of capacity sharing and, thus, increases the call blocking rate for most cases. In this paper, we consider the following problem: given a network topology, link capacity of each physical ...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملA STUDY ON NONLINEAR BEHAVIOR AND SEISMIC DAMAGE ASSESSMENT OF CONCRETE ARCH DAM-RESERVOIR-FOUNDATION SYSTEM USING ENDURANCE TIME ANALYSIS
In the present paper, nonlinear behavior of mass concrete simulated by smeared crack model is combined with Endurance Time Analysis (ETA) method for studying seismic response of arch dams. ETA is a time-history based dynamic pushover procedure in which special predesigned intensifying acceleration functions are used for analysis and estimation of structural responses in various performance leve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001